The Church - Rosser languages are the deterministicvariants of the growing context - sensitive languagesGundula
نویسندگان
چکیده
The growing context-sensitive languages have been classiied through the shrinking two-pushdown automaton, the deterministic version of which characterizes the class of generalized Church-Rosser languages (Buntrock and Otto 1995). Exploiting this characterization we prove that this latter class coincides with the class of Church-Rosser languages that was introduced by McNaughton, Narendran, and Otto (1988). Based on this result several open problems of McNaughton et al can be answered.
منابع مشابه
Church-Rosser Groups and Growing Context-Sensitive Groups
A finitely generated group is called a Church-Rosser group (growing contextsensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the ChurchRosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free language...
متن کاملRestarting automata , Church - Rosser languages , and con uent
Restarting automata with rewriting, RW-automata for short, were introduced by Jan car, Mrr az, Pll atek, and Vogel (1997). Here we generalize the RW-automata by adding extra tape symbols. In this way we obtain new characterizations for the class CFL of context-free languages and the class CRL of Church-Rosser languages, thus gaining additional information on the exact relationship between these...
متن کاملThe Size of Higman-Haines Sets
We show that for the family of Church-Rosser languages the Higman-Haines sets, which are the sets of all scattered subwords of a given language and the sets of all words that contain some word of a given language as a scattered subword, cannot be effectively constructed, although these both sets are regular for any language. This nicely contrasts the result on the effectiveness of the Higman-Ha...
متن کاملParikh-reducing Church-Rosser representations for some classes of regular languages
In this paper the concept of Parikh-reducing Church-Rosser systems is studied. It is shown that for two classes of regular languages there exist such systems which describe the languages using finitely many equivalence classes of the rewriting system. The two classes are: 1.) the class of all regular languages such that the syntactic monoid contains only abelian groups and 2.) the class of all ...
متن کاملRemarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
In 2002 Jurdziński and Loryś settled a long-standing conjecture that palindromes are not a Church-Rosser language. Their proof required a sophisticated theory about computation graphs of 2-stack automata. We present their proof in terms of 1-tape Turing machines. We also provide an alternative proof of Buntrock and Otto’s result that the set of bitstrings {x : (∀y)x 6= y}, which is context-free...
متن کامل